Scheduling games with machine-dependent priority lists
نویسندگان
چکیده
We consider a scheduling game on parallel related machines, in which jobs try to minimize their completion time by choosing machine be processed on. Each uses an individual priority list decide the order according are processed. prove that it is NP-hard if pure Nash equilibrium exists and characterize four classes of instances guaranteed exist. For each these classes, we give algorithm computes equilibrium, best-response dynamics converge bound inefficiency equilibria with respect makespan schedule sum times. In addition, show although exist identical approximate best both objectives.
منابع مشابه
Competitive Packet Routing with Priority Lists
In competitive packet routing games, packets are routed selfishly through a network and scheduling policies at edges determine which packages are forwarded first if there is not enough capacity on an edge to forward all packages at once. We analyze the impact of priority lists on the worst-case quality of pure Nash equilibria. A priority list is an ordered list of players that may or may not de...
متن کاملMachine scheduling with resource dependent processing times
We consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a scarce renewable resource. A given amount of that resource, e.g. workers, can be distributed...
متن کاملScheduling with job dependent machine speed
The power consumption rate of computing devices has seen an enormous increase over the last decades. Therefore computer systems must make a trade-off between performance and energy usage. This observation has led to speed scaling, a technique that adapts the speed of the system to balance energy and performance. Fundamentally, when implementing speed scaling, an algorithm must make two decision...
متن کاملSingle Machine Scheduling with Resource Dependent
Abstract We consider the single machine scheduling problem with resource dependent release times and processing times, in which both the release times and processing times are strictly linear decreasing functions of the amount of resources consumed. The objective is to minimize the makespan plus the total resource consumption costs. We propose a heuristic algorithm for the general problem by ut...
متن کاملSingle Machine Scheduling with Job-Dependent Machine Deterioration
We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2020.11.042